Direct Sparse Interval Hull Computations for Thin Non-M-Matrices
نویسندگان
چکیده
The computation of an enclosure for the solution of a sparse set of linear equations Ax = b with a thin matrix A and an interval right hand side b is considered. Gaussian elimination works well when the matrix is an M-matrix, but fails when the matrix is a general matrix. This paper illustrates how, for sparse matrices, an ordering intended to reduce the height of the elimination tree (and thus enhance parallelism of computations) can reduce the growth in the interval solution for general non-M-matrices. For banded matrices, it is shown that the growth in intervals is bounded by n, where n is the dimension of the matrix, rather than 2n. This result appears to hold for other types of sparse matrices. A second method based on singleton right hand side representations of b is shown to yield the hull of the solution. Best results are obtained by a combination of the singleton solver with path length shortening permutations.
منابع مشابه
CAS WAVELET METHOD FOR THE NUMERICAL SOLUTION OF BOUNDARY INTEGRAL EQUATIONS WITH LOGARITHMIC SINGULAR KERNELS
In this paper, we present a computational method for solving boundary integral equations with loga-rithmic singular kernels which occur as reformulations of a boundary value problem for the Laplacian equation. Themethod is based on the use of the Galerkin method with CAS wavelets constructed on the unit interval as basis.This approach utilizes the non-uniform Gauss-Legendre quadrature rule for ...
متن کاملStudy of multihomogeneous polynomial systems via resultant matrices
Resultants provide conditions for the solvability of polynomial equations and allow reducing polynomial system solving to linear algebra computations. Sparse resultants depend on the Newton polytopes of the input equations. This polytope is the convex hull of the exponent vectors corresponding to the nonzero monomials of the equations (viewed as lattice points in the Cartesian space of dimensio...
متن کاملRestricted isometry property of matrices with independent columns and neighborly polytopes by random sampling
This paper considers compressed sensing matrices and neighborliness of a centrally symmetric convex polytope generated by vectors ±X1, . . . ,±XN ∈ Rn, (N ≥ n). We introduce a class of random sampling matrices and show that they satisfy a restricted isometry property (RIP) with overwhelming probability. In particular, we prove that matrices with i.i.d. centered and variance 1 entries that satis...
متن کاملOptimizing Sparse Matrix - Vector Product Computations Using Unroll and Jam
Large-scale scientific applications frequently compute sparse matrix vector products in their computational core. For this reason, techniques for computing sparse matrix vector products efficiently on modern architectures are important. This paper describes a strategy for improving the performance of sparse matrix vector product computations using a loop transformation known as unroll-and-jam. ...
متن کامل